Random Sampling Using -Vector

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Provably Fast Support Vector Regression Using Random Sampling

Support Vector Machines are a family of data analysis algorithms, based on convex Quadratic Programming. Their use has been demonstrated in classification, regression, and clustering problems. In previous work we have proved that a random sampling technique based on an evolving discrete probability distribution provides a training algorithm for Support Vector Classification with provably low ex...

متن کامل

A Random Sampling Technique for Training Support Vector Machines

Random sampling techniques have been developed for combinatorial optimization problems. In this note, we report an application of one of these techniques for training support vector machines (more precisely, primal-form maximal-margin classifiers) that solve two-group classification problems by using hyperplane classifiers. Through this research, we are aiming (I) to design efficient and theore...

متن کامل

Comparison Between Selective Sampling and Random Undersampling for Classification of Customer Defection Using Support Vector Machine

Corresponding Author: Heri Kuswanto Department of Statistics, Institut Teknologi Sepuluh Nopember (ITS), Surabaya, Indonesia Email: [email protected] Abstract: Quality of a product determines the customer loyalty and it can be measured by conducting a survey. Company ‘X’ that sells three kinds of product (low, medium and high price) collected very large dataset through an online surve...

متن کامل

Adaptive Sampling using Support Vector Machines

For these reasons, there is currently an increasing interest in the development of dynamic PRA methodologies [2, 3, 4, 5] since they can be used to address the deficiencies of the conventional methods listed above. However, while dynamic methodologies have distinct advantages over conventional methods, there is no general agreement about the need for dynamic methods due to the computational cha...

متن کامل

Selective Sampling Using Random Field Modelling

Most existing inductive learning algorithms assume the availability of a training set of labeled examples. In many domains, however, labeling the examples is a costly process that requires either intensive computation or manual labor. In such cases, it may be beneecial for the learner to be active by intelligent selection of examples for labeling with the goal of reducing the labeling cost. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computing in Science & Engineering

سال: 2019

ISSN: 1521-9615,1558-366X

DOI: 10.1109/mcse.2018.2882727